Detecting communities using asymptotical surprise
نویسندگان
چکیده
منابع مشابه
Detecting communities using asymptotical Surprise
Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective function, which implicitly contains the definition of a community. We here analyze a recently proposed measure called surprise, which assesses the quality of the partition of a network into communities. In its curren...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملDetecting Communities using Absorbing Markov Chains
Community detection is an important part of network analysis. The goal is simple: to detect how nodes in the graph ought to be grouped into communities. Some algorithms wholly partition the nodes; others allow for some nodes to be considered ”community-less”. Community detection has several applications: for example, suggesting connections (as in, say, Facebook) and determining network structur...
متن کاملDetecting Communities Using Link and Content Triangles
Community detection for uncovering the hidden community structure in large networks is an important task in analyzing complex networks. Most of the existing methods only consider link structure in networks, where the link information is usually sparse and noisy, which may result in a poor partition of a network. Fortunately, besides link structure, nodes, especially in social networks, are ofte...
متن کاملDetecting Overlapping Link Communities
We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2015
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.92.022816